The match - making

This paper discusses a cryptographic protocol to evaluate an and-gate such that a party can keep his input bit secret from the other party. Such a protocol is of interest, because it can be generalized to any logical circuit for any number of participants. A formal statement of this generalization reads as follows: n participants want to compute together a function f(x1; x2; :::; xn) with xi being their inputs; nobody wants to reveal information about his input except what can be logically be deduced from the output. The paper contains no new results but provides an illustration of a sub-eld of cryptography, and introduces several interesting protocols and protocol design techniques.